Maximum Spread of<tex>$D$</tex>-Dimensional Multiple Turbo Codes
نویسندگان
چکیده
منابع مشابه
Maximum Spread of D-dimensional Multiple Turbo Codes Second revised version
This paper presents the mathematical framework involved in the determination of an upper bound of the maximum spread value of a D-dimensional Turbo-Code of frame size N. This bound is named Sphere Bound (SB). It is obtained using some simple properties of Euclidian space (sphere packing in a finite volume). The SB obtained for dimension 2 is equal to N. 2. This result has already been conjectur...
متن کاملMultiple Turbo Codes
In this paper, we introduce multiple turbo codes and a suitable decoder structure derived from an approximation to the maximum a posteriori probability (MAP) decision rule, which is substantially different from the decoder for two-code-based encoders. We developed new rate 1/3 and 2/3 constituent codes to be used in the turbo encoder structure. These codes, for 2 to 32 states, are designed by u...
متن کاملDesign of Three-Dimensional Multiple Slice Turbo Codes
This paper proposes a new approach to designing low-complexity high-speed turbo codes for very low frame error rate applications. The key idea is to adapt and optimize the technique of multiple turbo codes to obtain the required frame error rate combined with a family of turbo codes, called multiple slice turbo codes (MSTCs), which allows high throughput at low hardware complexity. The proposed...
متن کاملMaximum a Posteriori Decoding of Turbo Codes
The process of turbo-code decoding starts with the formation of a posteriori probabilities (APPs) for each data bit, which is followed by choosing the data-bit value that corresponds to the maximum a posteriori (MAP) probability for that data bit. Upon reception of a corrupted code-bit sequence, the process of decisionmaking with APPs allows the MAP algorithm to determine the most likely inform...
متن کاملOn Multiple Slice Turbo Codes
The main problem concerning the hardware implementation of turbo codes is the lack of parallelism in the MAP-based decoding algorithm. This paper proposes to overcome this problem with a new family of turbo codes, named Slice Turbo Codes. This family is based on two ideas: the encoding of each dimension with P independent tail-biting codes and a constrained interleaver structure that allows par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2005
ISSN: 0090-6778
DOI: 10.1109/tcomm.2005.852832